The smallest defining set of a Steiner triple system
نویسندگان
چکیده
منابع مشابه
Smallest defining sets of directed triple systems
A directed triple system of order v, DTS(v), is a pair (V,B) where V is a set of v elements and B is a collection of ordered triples of distinct elements of V with the property that every ordered pair of distinct elements of V occurs in exactly one triple as a subsequence. A set of triples in a DTS(v) D is a defining set for D if it occurs in no other DTS(v) on the same set of points. A definin...
متن کاملMinimal defining sets in a family of Steiner triple systems
A defining set of a block design is a subset of the blocks of the design which are a subset of no other design with the same parameters. This paper describes and proves the existence of a certain type of set of blocks in the infinite family of Steiner triple systems isomorphic to the points and lines of the projective geometries over GF(2). It is then proven that these sets of blocks are defini...
متن کاملA Steiner triple system which colors all cubic graphs
We prove that there is a Steiner triple system T such that every simple cubic graph can have its edges coloured by points of T in such a way that for each vertex the colours of the three incident edges form a triple in T . This result complements the result of Holroyd and Škoviera that every bridgeless cubic graph admits a similar colouring by any Steiner triple system of order greater than 3. ...
متن کاملMinimum embedding of Steiner triple systems into (K4-e)-designs I
A (K4−e)-design on v +w points embeds a Steiner triple system if there is a subset of v points on which the graphs of the design induce the blocks of a Steiner triple system. It has been established that w ≥ v/3, and that when equality is met, such a minimum embedding of an STS(v) exists, except when v = 15. Equality only holds when v ≡ 15, 27 (mod 30). One natural question is: What is the smal...
متن کامل5-sparse Steiner Triple Systems of Order n Exist for Almost All Admissible n
Steiner triple systems are known to exist for orders n ≡ 1, 3 mod 6, the admissible orders. There are many known constructions for infinite classes of Steiner triple systems. However, Steiner triple systems that lack prescribed configurations are harder to find. This paper gives a proof that the spectrum of orders of 5-sparse Steiner triple systems has arithmetic density 1 as compared to the ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009